\begin{problem}{Minimize it!}{minimize.in}{minimize.out}{1 second}{4 MegaBytes}

Sasha tired of playing with his sticks and found more interesting thing he can do.
He wrote on the black board all numbers from 1 to $N$ in one string (so he got a very
large number)
and now wants to wipe exactly $M$ its digits
so that the number written will be as small as possible. Help him!

\InputFile

Input file consits of two integer numbers $M$ and $N$ ($0\le M\le 30000$, $1\le N\le 10000$).
Input data are correct so at least one digit will be contained in the output.

\OutputFile

Output file must contain the minimal number Sasha can get on the blackboard after deleting
$M$ digits with all leading zeros Sasha will get.

\Example
\begin{example}
\exmp{\quad12\\\\20}{0111114151617181920}
\end{example}

\end{problem}